P automata revisited
نویسندگان
چکیده
منابع مشابه
Higher dimensional automata revisited
The dual of a true concurrency schedule appears to be a false concurrency automaton, a paradox we resolved in a previous paper by extending the latter to higher dimensions. This extension may be formalized via such discrete geometries as n-categories, simplicial complexes, cubical complexes, and Chu spaces. We advocate the last as having a clear notion of event, a well-defined process algebra u...
متن کاملHybrid I/O Automata Revisited
In earlier work, we developed a mathematical hybrid I/O automaton (HIOA) modeling framework, capable of describing both discrete and continuous behavior. This framework has been used to analyze examples of automated transportation systems, intelligent vehicle highway systems, air traffic control systems, and consumer electronics applications. Here, we reconsider the basic definitions of the HIO...
متن کاملAutomata-Theoretic Model Checking Revisited
In automata-theoretic model checking we compose the design under verification with a Büchi automaton that accepts traces violating the specification. We then use graph algorithms to search for a counterexample trace. The basic theory of this approach was worked out in the 1980s, and the basic algorithms were developed during the 1990s. Both explicit and symbolic implementations, such as SPIN an...
متن کاملTimed P Automata
To study systems whose dynamics changes with time, an extension of timed P systems is introduced in which evolution rules may vary with time. The proposed model is a timed automaton with a discrete time domain and in which each state is a timed P system. A result on expressive power and on features of the formalism sufficient for full expressiveness is proved and, as an application example, the...
متن کاملRed-Green P Automata
In this short note we extend the notion of red-green Turing machines to specific variants of P automata. Acceptance and recognizability of finite strings by red-green automata are defined via infinite runs of the automaton on the input string and the way how to distinguish between red and green states.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.01.036